Metric trees
نویسندگان
چکیده
منابع مشابه
Compact Widths in Metric Trees
The definition of n-width of a bounded subset A in a normed linear space X is based on the existence of n-dimensional subspaces. Although the concept of an n-dimensional subspace is not available for metric trees, in this paper, using the properties of convex and compact subsets, we present a notion of n-widths for a metric tree, called Tn-widths. Later we discuss properties of Tn-widths, and s...
متن کاملStabilization of maximal metric trees
We present a formal definition of routing metrics and provide the necessary and sufficient conditions for a routing metric to be optimizable along a tree. Based upon these conditions we present a generalization of the shortest path tree which we call the “maximal metric tree”. We present a stabilizing protocol for constructing maximal metric trees. Our protocol demonstrates that the distance-ve...
متن کاملSome Results on Metric Trees
Using isometric embedding of metric trees into Banach spaces, this paper will investigate barycenters, type and cotype, and various measures of compactness of metric trees. A metric tree (T , d) is a metric space such that between any two of its points there is an unique arc that is isometric to an interval in R. We begin our investigation by examining isometric embeddings of metric trees into ...
متن کاملTwisting the Metric Space to Achieve Better Metric Trees
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low query performance. The problem is that the arrangement of the objects in these datasets over the metric space seems to be inappropriate for grouping. This can jeopardize query performance because the M-Tree structure is ...
متن کاملSlim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple way to quantify the degree of overlap between the nodes in a metric tree. It is well-known that the degree of overlap directly affects the query performance of index structures. There are many suggestions to reduce overlap in m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1991
ISSN: 0893-9659
DOI: 10.1016/0893-9659(91)90146-m